An Online Algorithm for Dimension-Bound Analysis
نویسنده
چکیده
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In theory the dimension can be as large as the number of processes in the computation, but in practice it is much smaller. We present an online algorithm to compute the dimension of a distributed computation. This algorithm requires the computation of the critical pairs of the partial order followed by the creation of extensions of the partial order. This is our next step toward the goal of creating an online vector clock whose size is bounded by the dimension of a distributed computation, not by the number of processes.
منابع مشابه
Analysis of a Dominant Retailer Dual-Channel Supply Chain under Customers’ Channel Preference: The α-Branch and Bound Solution Algorithm
This paper investigates the Stackelberg equilibrium for pricing and ordering decisions in a dominant retailer dual-channel supply chain. In a dual-channel sales network, the products are sold through both a traditional, physical retailer and a direct Internet channel. It is assumed that the retailer is the leader and the powerful member of the supply chain has the market power and acts as a lea...
متن کاملOnline Scheduling of Jobs for D-benevolent instances On Identical Machines
We consider online scheduling of jobs with specic release time on m identical machines. Each job has a weight and a size; the goal is maximizing total weight of completed jobs. At release time of a job it must immediately be scheduled on a machine or it will be rejected. It is also allowed during execution of a job to preempt it; however, it will be lost and only weight of completed jobs contri...
متن کاملOnline Streaming Feature Selection Using Geometric Series of the Adjacency Matrix of Features
Feature Selection (FS) is an important pre-processing step in machine learning and data mining. All the traditional feature selection methods assume that the entire feature space is available from the beginning. However, online streaming features (OSF) are an integral part of many real-world applications. In OSF, the number of training examples is fixed while the number of features grows with t...
متن کاملAn Algorithm Based on Theory of Constraints and Branch and Bound for Solving Integrated Product-Mix-Outsourcing Problem
One of the most important decision making problems in many production systems is identification and determination of products and their quantities according to available resources. This problem is called product-mix. However, in the real-world situations, for existing constrained resources, many companies try to provide some products from external resources to achieve more profits. In this pape...
متن کاملUpper bounds for noetherian dimension of all injective modules with Krull dimension
In this paper we give an upper bound for Noetherian dimension of all injective modules with Krull dimension on arbitrary rings. In particular, we also give an upper bound for Noetherian dimension of all Artinian modules on Noetherian duo rings.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999